Ordered fast fourier transforms on a massively parallel hypercube multiprocessor
نویسندگان
چکیده
منابع مشابه
Ordered Fast Fourier Transforms on a Massively Parallel Hypercube Multiprocessor
We examine design alternatives for ordered FFT algorithms on massively parallel hypercube multiprocessors such as the Connection Machine. Particular emphasis is placed on reducing communication which is known to dominate the overall computing time. To this end we combine the order and computational phases of the FFT and also use sequence to processor maps that reduce communication. The class of...
متن کاملFast Fourier Transforms
29 O(b log(b)) operations (using standard multiplication). As there are O(b= log(b)) primes in total, the running time of this stage of the algorithm is O(b 2 L), even using the \grammar school" method of integer multiplication. At this stage of the algorithm we have obtained a vector of length L whose entries are integral linear combinations of powers of with coeecients bounded by M in absolut...
متن کاملDimensionless Fast Fourier Transforms
This paper shows that there are fast Fourier transform (FFT) algorithms that work, for a fixed number of points, independent of the dimension. Changing the dimension is achieved by relabeling the input and the output and changing the “twiddle factors.” An important consequence of this result, is that a program designed to compute the 1-dimensional Fourier transform can be easily modified to com...
متن کاملParallel Fast Fourier Transforms for Non Power of Two Data
This report deals with parallel algorithms for computing discrete Fourier transforms of real sequences of length N not equal to a power of two. The method described is an extension of existing power of two transforms to sequences with N a product of small primes. In particular, this implementation requires N = 2 p 3 q 5 r. The communication required is the same as for a transform of length N = ...
متن کاملDeveloping Fast Fourier Transforms using the EXTENT Parallel Programming Environmentz
EXTENT stands for an EXpert system for TENsor product formula Translation. In this paper, we describe the development of programs for fast Fourier transforms (FFT) for vector multiprocessors and distributed-memory machines using the EXTENT system for formula translation. Several forms of the FFT have been presented in the literature. Each form has diierent characteristics and is best suited for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 1991
ISSN: 0743-7315
DOI: 10.1016/0743-7315(91)90028-8